SLT-Resolution for the Well-Founded Semantics

Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear for query evaluation but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The principal disadvantage of a non-linear approach is that it cannot be implemented using a simple, efficient stack-based memory structure nor can it be easily extended to handle some strictly sequential operators such as cuts in Prolog. In this paper, we present a linear tabling method, called SLT-resolution, for top-down evaluation of the well-founded semantics. SLT-resolution is a substantial extension of SLDNF-resolution with tabling. Its main features include: (1) It resolves infinite loops and redundant computations while preserving the linearity. (2) It is terminating, and sound and complete w.r.t. the well-founded semantics for programs with the bounded-term-size property with non-floundering queries. Its time complexity is comparable with SLG-resolution and polynomial for function-free logic programs. (3) Because of its linearity for query evaluation, SLT-resolution bridges the gap between the well-founded semantics and standard Prolog implementation techniques. It can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.Comment: Slight modificatio

Linear Tabulated Resolution Based on Prolog Control Strategy

Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG- resolution, and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabulated resolution called TP-resolution. TP-resolution has two distinctive features: (1) It makes linear tabulated derivations in the same way as Prolog except that infinite loops are broken and redundant computations are reduced. It handles cuts as effectively as Prolog. (2) It is sound and complete for positive logic programs with the bounded-term-size property. The underlying algorithm can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.Comment: To appear as the first accepted paper in Theory and Practice of Logic Programming (http://www.cwi.nl/projects/alp/TPLP

Observation of Landau level-like quantizations at 77 K along a strained-induced graphene ridge

Recent studies show that the electronic structures of graphene can be modified by strain and it was predicted that strain in graphene can induce peaks in the local density of states (LDOS) mimicking Landau levels (LLs) generated in the presence of a large magnetic field. Here we report scanning tunnelling spectroscopy (STS) observation of nine strain-induced peaks in LDOS at 77 K along a graphene ridge created when the graphene layer was cleaved from a sample of highly oriented pyrolytic graphite (HOPG). The energies of these peaks follow the progression of LLs of massless 'Dirac fermions' (DFs) in a magnetic field of 230 T. The results presented here suggest a possible route to realize zero-field quantum Hall-like effects at 77 K

A γ\gamma-ray Quasi-Periodic modulation in the Blazar PKS 0301−-243?

We report a nominally high-confidence $\gamma$-ray quasi-periodic modulation in the blazar PKS 0301$-$243. For this target, we analyze its \emph{Fermi}-LAT Pass 8 data covering from 2008 August to 2017 May. Two techniques, i.e., the maximum likelihood optimization and the exposure-weighted aperture photometry, are used to build the $\gamma$-ray light curves. Then both the Lomb-Scargle Periodogram and the Weighted Wavelet Z-transform are applied to the light curves to search for period signals. A quasi-periodicity with a period of $2.1\pm0.3$ yr appears at the significance level of $\sim5\sigma$, although it should be noted that this putative quasi-period variability is seen in a data set barely four times longer. We speculate that this $\gamma$-ray quasi-periodic modulation might be evidence of a binary supermassive black hole.Comment: 9 pages, 8 figures; Accepted for publication in Ap